k intersection colouring
نویسندگان
چکیده
We propose the following problem. A graph G is to be properly edge coloured such that any two adjacent vertices share at most k colours. We call this the k-intersection colouring. The minimum number of colours required for such a colouring is the kintersection chromatic index and is denoted χk. Let f be defined by fk(∆) = max G:∆(G)=∆ {χk(G)} We show that fk(∆) = Θ( 2 k ). We also discuss some open problems.
منابع مشابه
On k-intersection edge colourings
We propose the following problem. For some k ≥ 1, a graph G is to be properly edge coloured such that any two adjacent vertices share at most k colours. We call this the k-intersection edge colouring. The minimum number of colours sufficient to guarantee such a colouring is the k-intersection chromatic index and is denoted χk(G). Let fk be defined by fk(∆) = max G:∆(G)=∆ {χk(G)}. We show that f...
متن کاملThe Complexity of Colouring Circle Graphs
We study the complexity of the colouring problem for circle graphs. We will solve the two open questions of [Un88], where first results were presented. 1. Here we will present an algorithm which solves the 3-colouring problem of circle graphs in time O(n log(n)). In [Un88] we showed that the 4-colouring problem for circle graphs is NP-complete. 2. If the largest clique of a circle graph has siz...
متن کاملRandomly colouring simple hypergraphs
We study the problem of constructing a (near) random proper q-colouring of a simple k-uniform hypergraph with n vertices and maximum degree ∆. (Proper in that no edge is mono-coloured and simple in that two edges have maximum intersection of size one). We give conditions on q,∆ so that if these conditions are satisfied, Glauber dynamics will converge in O(n log n) time from a random (improper) ...
متن کاملSemidefinite Programming Relaxations in Timetabling
This paper extends semidefinite programming relaxations of graph colouring to bounded graph colouring and extensions encountered in timetabling, where room sizes, room features, room stability, and pre-allocated assignments are considered. A matrix-free implementation of an augmented Lagrangian method is presented. Encouraging computational results are reported for conflict graphs from all thre...
متن کاملColouring Relatives of Intervals on the Plane, II: Intervals and Rays in Two Directions
I: intersection graphs of intervals on the plane; R: intersection graphs of rays on the plane; S: intersection graphs of families of strings on the plane such that the intersection of any two strings is a connected subset of the plane; Im : intersection graphs of intervals on the plane parallel to some m lines; Rm : intersection graphs of rays on the plane parallel to some m lines. In particula...
متن کامل